内置谓词函数依赖及其推理规则

研究内置谓词函数依赖及其推理规则.首先提出内置谓词函数依赖,定义了内置谓词函数依赖的语法和语义;其次提出属性-约束集闭包概念,提出计算属性-约束集闭包的算法,判断内置谓词函数依赖逻辑蕴涵;然后提出内置谓词函数依赖的推理规则集A,证明推理规则集A是可靠且完备的,用于内置谓词函数依赖蕴涵分析的形式化证明;最后讨论了内置谓词函数依赖的应用.     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

复杂大系统仿真的VV&A理论及过程研究

为了确保复杂大系统仿真(LCSS)的可信性,应该在建模与仿真(M&S)的全生命周期中开展校核、验证与确认(VV&A)研究.对LCSS的VV&A进行了理论研究,提出其方法论与原则;以基于仿真组件构建的HLA仿真系统为例,从仿真组件层、联邦成员层及联邦层三个层面研究了VV&A过程,并将这些研究应用于反舰导弹突防联邦仿真中.实践表明,研究对LCSS的VV&A工作具有很好的指导作用,有力地保障了仿真的可信性.     

高非线性度弹性S盒的构造

弹性S盒可应用于容错分布计算,量子密码密钥分配和流密码中伪随机序列产生.基于线性码和高非线性度的S盒,给出了一种构造具有高非线性度,且代数次数大于给定值的弹性S盒的方法.对于给定参数的线性码,构造的弹性S盒的非线性度是可以计算的.结果表明所构造的函数的非线性度优于已有的结果.     

A worst‐case formulation for constrained ranking and selection with input uncertainty

In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.     

New product introduction against a predator: A bilevel mixed‐integer programming approach

We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

分段供电切换传感器的在线故障诊断方法

分段供电切换传感器是多段直线电机控制系统的重要部件。针对其故障检测与定位的问题,提出一种切换传感器故障的在线诊断方法。对采集的传感器信号数据进行压缩,以提高计算的效率;研究切换传感器信号根据次级运动的变化规律,定义标准信号集合;给出计算传感信号差异度的方法,作为分析信号相似程度的量化指标;将问题表示为基于有向图的搜索问题,并根据问题的特点缩小搜索的范围;由此提出搜索算法,可以根据测量的传感信号时序估计传感系统的状态变迁过程;给出故障定位流程,利用算法估计的结果,根据系统标准信号集合进行故障定位。为了说明算法与预期结果的一致性,给出3个命题并进行证明;通过实验验证了故障诊断方法的有效性。     

一种舰船目标一维距离像识别的新方法

提出了一种基于傅里叶-梅林变换和二叉树支持向量机相结合的舰船目标一维距离像识别方法。该方法充分利用了傅里叶-梅林变换具有的时移与尺度不变性和支持向量机在小样本分类中的优势,可以改善目标的特征稳定性,提高识别性能。针对多类舰船目标的识别,提出采用聚类分析中的均值距离来生成二叉树,将分类器分布在各个节点上,构成了多类支持向量机,减少了分类器数量和重复训练样本的数量。对4类舰船目标仿真实验的结果表明,该分类方法具有较高的识别性能、较快的识别速度。     

Technical note: Traffic intensity estimation

This note examines estimation of the traffic intensity in an M/G/1 queue. We show that the ratio of sample mean service times to the sample mean interarrival times has undesirable sampling properties. To remedy this, two alternative estimators are introduced. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于一元线性回归分析的舵机故障诊断算法

针对舵机的卡死、松浮和输出偏差等故障采用基于模型的方法检测.故障诊断分两步进行,首先采用等价空间法来检测是否发生故障,在检测到故障的基础上引入一元线性回归分析对故障的性质和程度进行估计,并给出了根据舵机输入输出特性选取估计参数的方法.仿真结果表明,所采用故障诊断算法的实时性、准确性较好,具有一定的工程实用价值.